Explicit Computation of Isomorphisms between Finite Fields
نویسندگان
چکیده
منابع مشابه
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves
We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two degree n extensions of the finite field with q elements, our algorithm takes Õ ( n log q +max l (ll log q + l log q) ) time, where l runs through primes dividing n but not q(q − 1) and nl denotes the highest power of l dividing n. Prior to this work, the b...
متن کاملComputing isomorphisms and embeddings of finite fields
Let Fq be a finite field. Given two irreducible polynomials f, g over Fq, with deg f dividing deg g, the finite field embedding problem asks to compute an explicit description of a field embedding of Fq[X]/f(X) into Fq[Y ]/g(Y ). When deg f = deg g, this is also known as the isomorphism problem. This problem, a special instance of polynomial factorization, plays a central role in computer algeb...
متن کاملEfficient Computation of Roots in Finite Fields
We present an algorithm to compute r-th roots in Fqm with complexity O((logm + r log q)m log q) for certain choices of m and q. This compares well to previously known algorithms, which need O(rm log q) steps.
متن کاملComplexity of computation in Finite Fields
Efficient implementation of arithmetic in finite fields is of primary importance for cryptography, coding theory, digital signal processing etc. (see, for example [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]). In this survey we consider only Boolean circuits for arithmetic operations in finite fields. Another term: bit-parallel circuits. Boolean circuits for multiplication and inversion in finite fields are...
متن کاملIsomorphisms of Algebraic Number Fields
Let Q(α) and Q(β) be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q(β) → Q(α). The algorithm is particularly efficient if there is only one isomorphism.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2002
ISSN: 1071-5797
DOI: 10.1006/ffta.2001.0344